A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem
نویسندگان
چکیده
The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for computing a maximal ( 2 -approximation) matching in a general graph, as well as computing a 3 -approximation on more specific graph types. In the following we present the first selfstabilizing algorithm for finding a 3 -approximation to the maximum matching problem in a general graph. We show that our new algorithm stabilizes in at most exponential time under a distributed adversarial daemon, and O(n) rounds under a distributed fair daemon, where n is the number of nodes in the graph.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملA Self-Stabilizing Algorithm for Maximum Matching in Trees
Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many eecient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a distributed, self-stabilizing algorithm for nding a maximum matching in trees. Since our algorithm...
متن کاملPolynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching
We present the first polynomial self-stabilizing algorithm for finding a 2 3 -approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne et al. [6] and has a sub-exponential time complexity under the distributed adversarial daemon [1]. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but ...
متن کاملA Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists
In this paper, we consider the problem of Popular Matching of strictly ordered preference lists. A Popular Matching is not guaranteed to exist in any network. We propose an IDbased, constant space, self-stabilizing algorithm that converges to a Maximum Popular Matching—an optimum solution, if one exist. We show that the algorithm stabilizes in moves under any scheduler (daemon). Keywords—self-s...
متن کاملA Self-stabilizing Weighted Matching Algorithm
The problem of computing a matching in a graph involves creating pairs of neighboring nodes such that no node is paired more than once. Previous work on the matching problem has resulted in several selfstabilizing algorithms for finding a maximal matching in an unweighted graph. In this paper we present the first self-stabilizing algorithm for the weighted matching problem. We show that the alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008